Probing Mechanism Scheduling for Connected Coverage Wireless Sensor Network
نویسندگان
چکیده
منابع مشابه
Connected Coverage Assurance for Sensor Scheduling in Wireless Sensor Networks
.......................................................................................................................... iii Acknowledgements ................................................................................................................. iv Table of
متن کاملSensor and Sink Placement, Scheduling and Routing Algorithms for Connected Coverage of Wireless Sensor Networks
A sensor is a small electronic device which has the ability to sense, compute and communicate either with other sensors or directly with a base station (sink). In a wireless sensor network (WSN), the sensors monitor a region and transmit the collected data packets through routes to the sinks. In this study, we propose a mixed--integer linear programming (MILP) model to maximize the number of ti...
متن کاملSensor Scheduling for k-Coverage in Wireless Sensor Networks
Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored region can be k-covered throughout the whole network lifetime with the purpose of m...
متن کاملJoint Design of Scheduling and Routing Based on Connected Coverage for Optimal Sensor Network Lifetime
We consider information retrieval in a wireless sensor network deployed to monitor a spatially corrected random filed. The measured data are sent to an access point through multi-hop transmissions. We address the joint design of sensor scheduling and information routing in each data collection to optimize a performance measure: network lifetime. We first formulate this problem as an integer pro...
متن کاملComplexity Results for Wireless Sensor Network Scheduling
We study the problem of scheduling multiple sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2011
ISSN: 1812-5638
DOI: 10.3923/itj.2011.579.584